#include <bits/stdc++.h>

#include <unordered_set>

#define ll long long
#define ull unsigned long long
#define uint unsigned int

#define YES cout << "YES" << '\n'
#define NO cout << "NO" << '\n'
#define endl '\n'
const int INF = 1e9;
const int MOD = 998244353;
using namespace std;

/*思考  D. 二进制字符串对决
Alice最佳策略：修改跨度大于k为最优修改
Bob最佳策略：修改跨度等于k为最优修改
如果1的个数小于等于k，或者n小于2*k，则Alice获胜
否则进入循环Bob获胜
*/

void solve()
{
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int cnt1 = 0;
    for (int i = 0; i < n; i++)
    {
        if (s[i] == '1')
        {
            cnt1++;
        }
    }
    if (cnt1 <= k || n < 2 * k)
    {
        cout << "Alice" << endl;
    }
    else
    {
        cout << "Bob" << endl;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 0;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}